In DEA to obtain an efficient representation in CCR and BCC models for each DMU only one linear plan would be solved; however, it is possible in centralized resource allocation (CRA) to solve all the DMUs by one linear planning. In this paper, models of centralized resource allocation in input-oriented and in dynamic case will be offered and by using dynamic SBM, the representation of DMUs in each time period and in general and based on CRA in input oriented case will be obtained. After that, the theorems of the offered models will be shown and at least, an applicable example will be represented.

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of singleclass dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method.

One of the obvious reasons for most disorders in network service provisioning is network path congestion. Congestion avoidance in today's networks is too costly and sometimes impossible. With the introduction of SDN, centralizing the equipment's control plane has become possible. This paper presents an enhanced method named ESV-DBRA to avoid congestion in multi-tenant SDN networks. At first, ESV-DBRA monitors the traffic load and delay of all network paths for each tenant individually. Then, by merging the parameters obtained from the monitoring, the Service Level Agreements (SLA), and a novel proposed cost function, it calculates the cost of the network paths per tenant. As a result, traffic for each tenant is routed through the path/paths at the lowest possible cost from the tenant's perspective. Next, the bandwidth quotas will be calculated and assigned to the tenants over their optimal routes. Afterward, whenever congestion is likely to occur in a path, ESV-DBRA automatically changes the route or bandwidth of the tenants' traffic related to this path to avoid congestion. Related algorithms are also proposed.Eventually, simulations show that the proposed method effectively increases bandwidth utilization by 10.76%.

networks are analytically modeled, where new projects are expected to arrive according to a Poisson process, and activity durations are also known as independent random variables with exponential distributions. Such system is represented as a queuing network, where multi servers at each service station are allocated, and also each activity of a project is operated at a devoted service station with only one server located at a node of the network based on First Come First Serve (FCFS) policy. In order to propose a novel approach for modeling of multi-server dynamic PERT network, initially the network of queues is transformed into a stochastic network. Then, a differential equations system is organized to solve and obtain approximate completion time distribution for any particular project by applying an appropriate finite-state continuous-time Markov model. Finally, a multi-objective model including four conflicted objectives is presented to optimally control the resources allocated to the service stations in a multi-server dynamic PERT network, and the goal attainment method is further employed to solve a discrete time approximation of the primary multi-objective problem.

Due to the limitations of the natural frequency spectrum, dynamic frequency allocation is required for wireless networks. Spectrum sensing of a radio channel is a technique to identify the spectrum holes. In this paper, we investigate a dynamic cognitive sensor network, in which the cognitive sensor transmitter has the capability of the energy harvesting. In the first slot, the cognitive sensor transmitter participates in spectrum sensing and in the existence of the primary user, it harvests the energy from the primary signal, otherwise the sensor transmitter sends its signal to the corresponding receiver while in the second slot, using the decode-and-forward (DF) protocol, a part of the bandwidth is used to forward the signal of the primary user and the remained bandwidth is used for transmission of the cognitive sensor. Therefore, our purposed algorithm is to maximize the cognitive network transmission rate by selection of the suitable cognitive sensor transmitters subject to the rate of the primary transmission and energy consumption of the cognitive sensors according to the mobility model of the cognitive sensors in the dynamic network. Simulation results illustrate the effectiveness of the proposed algorithm in performance improvement of the network as well as reducing the energy consumption

The purpose of this study is to design a resource allocation model in educational organizations. In this research, the statistical society was defined in two formats. The research method is a survey and statistically of a type of development. The sampling method was used in the research in the experts section of the census type and in the educational-oriented organizations of the simple cluster type. In this research, to increase the validity of the questionnaire, a questionnaire was prepared, then articles, books and journals were designed and then questioned with a number of professors, and questions were considered. Then, a number of questionnaires were distributed among each section of the statistical society and all ambiguities were identified and resolved and the final questionnaire was distributed. Since the questionnaires are made up of a series of indicators or criteria, their reliability is unnecessary. Delphi analysis method and AHP hierarchical analysis method were used to analyze the data. In Delphi analysis, 23 factors were identified in the form of three dimensions of financial, physical, technological and human resources. Also, the results of the AHP hierarchical analysis showed that financial costs have the highest priority among dimensions. After that, physical and technological resources have been prioritized.